Wasserstein distributionally robust shortest path problem

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributionally robust stochastic shortest path problem

This paper considers a stochastic version of the shortest path problem, the Distributionally Robust Stochastic Shortest Path Problem(DRSSPP) on directed graphs. In this model, the arc costs are deterministic, while each arc has a random delay. The mean vector and the second-moment matrix of the uncertain data are assumed known, but the exact information of the distribution is unknown. A penalty...

متن کامل

Distributionally Robust Stochastic Optimization with Wasserstein Distance

Distributionally robust stochastic optimization (DRSO) is a robust approach to stochastic optimization problems in which the underlying distribution is not known exactly. It seeks a decision which hedges against the worst-case distribution in an ambiguity set, containing a family of distributions relevant to the considered problem. Unfortunately, the worst-case distributions resulting from many...

متن کامل

Wasserstein distance and the distributionally robust TSP

Recent research on the robust and stochastic travelling salesman problem and the vehicle routing problem has seen many different approaches for describing the region of ambiguity, such as taking convex combinations of observed demand vectors or imposing constraints on the moments of the spatial demand distribution. One approach that has been used outside the transportation sector is the use of ...

متن کامل

On the robust shortest path problem

The shortest path (SP) problem in a network with nonnegative arc lengths can be solved easily by Dijkstra’s labeling algorithm in polynomial time. In the case of significant uncertainty of the arc lengths, a robustness approach is more appropriate. In this paper, we study the SP problem under arc length uncertainties. A scenario approach is adopted to characterize uncertainties. Two robustness ...

متن کامل

Distributionally Robust Reward-risk Ratio Programming with Wasserstein Metric

Reward-risk ratio (RR) is a very important stock market definition. In order to capture the situation that the investor does not have complete information on the distribution of the underlying uncertainty, people extend RR model to distributionally robust reward-risk ratio (DRR) model. In this paper, we study the DRR problem where the ambiguity on the distributions is defined through Wassertein...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Operational Research

سال: 2020

ISSN: 0377-2217

DOI: 10.1016/j.ejor.2020.01.009